Quantum basin hopping with gradient-based local optimisation
نویسنده
چکیده
The quantum basin hopping algorithm for continuous global optimisation combines a local search with Grover’s algorithm, and can locate the global optimum using effort proportional to the square root of the number of basins. This article establishes that Jordan’s quantum gradient estimation method can be incorporated into the quantum basin hopper, providing an extra acceleration proportional to the domain dimension. MSC2000 Subject Classification: 90C30, 68Q99, 68Q25
منابع مشابه
An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container
This paper addresses the equal circle packing problem, and proposes an efficient Quasi-physical Quasi-human (QPQH) algorithm. QPQH is based on a modified Broyden-Fletcher-GoldfarbShanno (BFGS) algorithm which we call the local BFGS and a new basin hopping strategy based on a Chinese idiom: alternate tension with relaxation. Starting from a random initial layout, we apply the local BFGS algorith...
متن کاملAn Efficient Quasi-physical Algorithm for Packing Equal Circles in a Circular Container
This paper addresses the equal circle packing problem, and proposes an efficient quasi-physical algorithm(EQPA). EQPA is based on an improved BFGS algorithm and a new basin hopping strategy. Starting form a random initial pattern, we use the modified BFGS algorithm to reach a local minimum pattern. The modified BFGS algorithm fully utilizes the neighborhood information and considerably speeds u...
متن کاملQuasi-combinatorial energy landscapes for nanoalloy structure optimisation.
We formulate nanoalloy structure prediction as a mixed-variable optimisation problem, where the homotops can be associated with an effective, quasi-combinatorial energy landscape in permutation space. We survey this effective landscape for a representative set of binary systems modelled by the Gupta potential. In segregating systems with small lattice mismatch, we find that homotops have a rela...
متن کاملFunnel hopping: Searching the cluster potential energy surface over the funnels.
We designed a cluster surface smoothing method that can fast locate the minimum of the funnels in the potential energy surface (PES). By inserting the cluster surface smoothing approach into the gradient-based local optimization (LO)-phase and the global optimization (GO)-phase as a second LO-phase, the GO-phase can focus on the global information oWalesf the PES over the various funnels. Follo...
متن کاملCommunication: a new paradigm for structure prediction in multicomponent systems.
We analyse the combinatorial aspect of global optimisation for multicomponent systems, which involves searching for the optimal chemical ordering by permuting particles corresponding to different species. The overall composition is presumed fixed, and the geometry is relaxed after each permutation in order to relieve local strain. From ideas used to solve graph partitioning problems we devise a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008